Travelling salesman problem

Results: 321



#Item
181NP-complete problems / Complexity classes / Operations research / Combinatorial optimization / Travelling salesman problem / Optimization problem / NP / Branch and bound / Mathematical optimization / Theoretical computer science / Computational complexity theory / Applied mathematics

Artificial Intelligence Artificial Intelligence

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2009-03-06 00:35:16
182Software design patterns / Object-oriented programming / C++ / ACCU / Science and technology in the United Kingdom / Kevlin Henney / Overload / Travelling salesman problem / Pattern language / Software engineering / Computing / Computer programming

OVERLOAD CONTENTS OVERLOAD 82 December 2007

Add to Reading List

Source URL: www.accu.org

Language: English - Date: 2007-12-09 05:31:26
183Theoretical computer science / Scheduling / Travelling salesman problem / Assignment problem / Mathematical optimization / Operations research / Mathematics / Applied mathematics

On the Impact of Real-Time Information on Field Service Scheduling Ioannis Petrakis, Christian Hass, Martin Bichler 1 Department of Informatics, TU München, Germany Mobile phone operators need to plan and schedule fiel

Add to Reading List

Source URL: dss.in.tum.de

Language: English - Date: 2012-01-26 04:23:42
184NP-complete problems / Operations research / Elementary mathematics / Travelling salesman problem / Computational complexity theory / Analytic geometry / Combinatorial optimization / Distance / Cartesian coordinate system / Mathematics / Theoretical computer science / Applied mathematics

The x-and-y-axes travelling salesman problem Eranda C ¸ ela∗ Vladimir Deineko†‡

Add to Reading List

Source URL: www.opt.math.tu-graz.ac.at

Language: English - Date: 2012-08-17 06:11:47
185NP-complete problems / Operations research / Neural networks / Dimension reduction / Travelling salesman problem / Self-organizing map / SOM / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

Defining lines of maximum probability for the design of patrol vessel itineraries Fernando Bação1 Victor Lobo2 1 ISEGI-UNL

Add to Reading List

Source URL: www.agile-online.org

Language: English - Date: 2005-04-22 13:29:42
186Mathematics / Combinatorial optimization / Mathematical optimization / Ant colony optimization algorithms / Travelling salesman problem / Optimization problem / Swarm intelligence / Theoretical computer science / Applied mathematics / Operations research

Tommaso Urli Hybrid Meta-Heuristics for Combinatorial Optimization Ph.D. Thesis

Add to Reading List

Source URL: tunnuz.net

Language: English - Date: 2014-09-12 00:58:22
187Software design patterns / Object-oriented programming / C++ / ACCU / Science and technology in the United Kingdom / Kevlin Henney / Overload / Travelling salesman problem / Pattern language / Software engineering / Computing / Computer programming

OVERLOAD CONTENTS OVERLOAD 82 December 2007

Add to Reading List

Source URL: accu.org

Language: English - Date: 2007-12-09 05:31:26
188NP-complete problems / Operations research / Simulated annealing / Combinatorial optimization / Travelling salesman problem / Graph partition / Local search / Algorithm / Kernighan–Lin algorithm / Theoretical computer science / Mathematics / Applied mathematics

ARTICLES OPTIMIZATION BY SIMULATED ANNEALING: AN EXPERIMENTAL EVALUATION; PART I, GRAPH PARTITIONING DAVID S. JOHNSON AT&T Bell Laboratories, Murray Hill, New Jersey

Add to Reading List

Source URL: www-vis.lbl.gov

Language: English - Date: 2009-06-12 15:46:04
189Planning / Applied mathematics / Mathematics / Community health worker / Vehicle routing problem / Travelling salesman problem / Scheduling / Health care / Routing / Operations research / Theoretical computer science / NP-complete problems

Routing for Rural Health: Optimizing Community Health Worker Visit Schedules Emma Brunskill Neal Lesh Computer Science Division

Add to Reading List

Source URL: ai-d.org

Language: English - Date: 2010-04-24 15:52:19
190Complexity classes / NP-complete problems / Operations research / Mathematical optimization / Spanning tree / Travelling salesman problem / Minimum spanning tree / NP-hard / NP-complete / Theoretical computer science / Computational complexity theory / Applied mathematics

The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed]

Add to Reading List

Source URL: www.cs.rit.edu

Language: English - Date: 2003-06-11 09:35:55
UPDATE